Categorical Glueing and Logical Predicates for Models of Linear Logic

نویسنده

  • Masahito Hasegawa
چکیده

We give a series of glueing constructions for categorical models of fragments of linear logic. Specifically, we consider the glueing of (i) symmetric monoidal closed categories (models of Multiplicative Intuitionistic Linear Logic), (ii) symmetric monoidal adjunctions (for interpreting the modality !) and (iii) -autonomous categories (models of Multiplicative Linear Logic); the glueing construction for -autonomous categories is a mild generalization of the double glueing construction due to Hyland and Tan. Each of the glueing techniques can be used for creating interesting models of linear logic. In particular, we use them, together with the free symmetric monoidal cocompletion, for deriving Kripke-like parameterized logical predicates (logical relations) for the fragments of linear logic. As an application, we show full completeness results for translations between linear type theories.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Fully Complete Models of Multiplicative Linear Logic

The multiplicative fragment of Linear Logic is the formal system in this family with the best understood proof theory, and the categorical models which best capture this theory are the fully complete ones. We demonstrate how the Hyland-Tan double glueing construction produces such categories, either with or without units, when applied to any of a large family of degenerate models. This process ...

متن کامل

Glueing and orthogonality for models of linear logic

We present the general theory of the method of glueing and associated technique of orthogonality for constructing categorical models of all the structure of linear logic: in particular we treat the exponentials in detail. We indicate simple applications of the methods and show that they cover familiar examples.

متن کامل

A generalisation of pre-logical predicates and its applications

This thesis proposes a generalisation of pre-logical predicates to simply typed formal systems and their categorical models. We analyse the three elements involved in pre-logical predicates — syntax, semantics and predicates — within a categorical framework for typed binding syntax and semantics. We then formulate generalised pre-logical predicates and show two distinguishing properties: a) equ...

متن کامل

A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems

We generalise the notion of pre-logical predicates [HS02] to arbitrary simply typed formal systems and their categorical models. We establish the basic lemma of pre-logical predicates and composability of binary pre-logical relations in this generalised setting. This generalisation takes place in a categorical framework for typed higher-order abstract syntax and semantics [Fio02,MS03].

متن کامل

Categorical Proof Theory of Co-Intuitionistic Linear Logic

To provide a categorical semantics for co-intuitionistic logic, one has to face the fact, noted by Tristan Crolard, that the definition of co-exponents as adjuncts of co-products does not work in the category Set, where co-products are disjoint unions. Following the familiar construction of models of intuitionistic linear logic with exponent !, we build models of co-intuitionistic logic in symm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999